New Local Search Procedure for Workforce Planning Problem
نویسندگان
چکیده
منابع مشابه
Combination of Local Search Strategies for Rotating Workforce Scheduling Problem
Rotating workforce scheduling is a typical constraint satisfaction problem which appears in a broad range of work places (e.g. industrial plants). Solving this problem is of a high practical relevance. In this paper we propose the combination of tabu search with random walk and min conflicts strategy to solve this problem. Computational results for benchmark examples in literature and other rea...
متن کاملFast local search and guided local search and their application to British Telecom's workforce scheduling problem
This paper reports a Fast Local Search (FLS) algorithm which helps to improve the efficiency of hill climbing and a Guided Local Search (GLS) Algorithm which is developed to help local search to escape local optima and distribute search effort. To illustrate how these algorithms work, this paper describes their application to British Telecom’s workforce scheduling problem, which is a hard real ...
متن کاملLocal Search for a Cargo Assembly Planning Problem
We consider a real-world cargo assembly planning problem arising in a coal supply chain. The cargoes are built on the stockyard at a port terminal from coal delivered by trains. Then the cargoes are loaded onto vessels. Only a limited number of arriving vessels is known in advance. The goal is to minimize the average delay time of the vessels over a long planning period. We model the problem in...
متن کاملLocal search for the surgery admission planning problem
We present a model for the surgery admission planning problem, and a meta-heuristic algorithm for solving it. The problem involves assigning operating rooms and dates to a set of elective surgeries, as well as scheduling the surgeries of each day and room. Simultaneously, a schedule is created for each surgeon to avoid double bookings. The presented algorithm uses simple Relocate and Two-Exchan...
متن کاملAdaptive Local Search for a New Military Frequency Hopping Planning Problem
The military radio stations with frequency hopping propose new problems of frequency assignment which must take into account the size of the deployment, the limited resources and also new interferences constraints on transmitters. This new problem is public since the publication [1] with a set of 10 instances. The computing resources and the computing times are imposed. We tackle this problem w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cybernetics and Information Technologies
سال: 2020
ISSN: 1314-4081
DOI: 10.2478/cait-2020-0059